On the speedup required for work-conserving crossbar switches
نویسندگان
چکیده
This paper describes the architecture for a workconserving server using a combined I/O-buffered crossbar switch. The switch employs a novel algorithm based on output occupancy, the lowest occupancy output first algorithm (LOOFA), and a speedup of only two. A work-conserving switch provides the same throughput performance as an output-buffered switch. The workconserving property of the switch is independent of the switch size and input traffic pattern. We also present a suite of algorithms that can be used in combination with LOOFA. These algorithms determine the fairness and delay properties of the switch. We also describe a mechanism to provide delay bounds for real-time traffic using LOOFA. These delay bounds are achievable without requiring output-buffered switch emulation.
منابع مشابه
An Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch
This paper focuses on two desired properties of cell-based switches for digital data networks: (1) data cells should not be detained inside the switch any longer than necessary (the work-conserving property) and (2) data cells that have been in the switch longer (older cells) should have priority over younger cells (the order-conserving property). A well-known, but expensive design of a workand...
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملWhen is a Work-Conserving Switch Not?
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells,...
متن کاملWhen is a Work-Conserving Switch Not?
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells,...
متن کاملOn Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann
Based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix, in this paper we propose a scheduling algorithm that is capable of providing service guarantees for input-buffered crossbar switches. Our service guarantees are uniformly good for all non-uniform traffic, and thus imply 100% throughput. The off-line computational complexity to identify the scheduling ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 17 شماره
صفحات -
تاریخ انتشار 1999